Nuprl Lemma : finite-set-type-cases 0,22

T:Type, L:(TProp) List, P:(TProp).
(x:T. Dec(P(x)))
 (QLx:T. Dec(Q(x)))
 (QL. finite-type({x:TQ(x) }))
 (x:TP(x (QL.Q(x)))
 finite-type({x:TP(x) }) 
latex


Definitionst  T, x(s), x:AB(x), P  Q, P  Q, xt(x), P & Q, P  Q, xLP(x), Prop, Dec(P), finite-type(T), (xL.P(x)), (x  l), l[i], x:AB(x), ||as||, {i..j}, False, A, AB, i  j < k, ij, , upto(n), 1of(t), map(f;as), concat(ll), A & B, {T}, SQType(T), True, T
Lemmasmember upto, le wf, member-concat, exists functionality wrt iff, and functionality wrt iff, member map, concat wf, map wf, pi1 wf, upto wf, non neg length, l member wf, int seg wf, length wf1, select wf, select member, l exists wf, finite-type wf, l all wf, decidable wf, finite-decidable-set

origin